منابع مشابه
Path Auctions with Multiple Edge Ownership 1
In this paper, we study path auction games in which multiple edges may be owned by the same agent. The edge costs and the set of edges owned by the same agent are privately known to the owner of the edges. In this setting, we show that, assuming that edges not on the winning path always get 0 payment, there is no individually rational, strategyproof mechanism in which only edge costs are report...
متن کاملPath Auctions When an Agent Can Own Multiple Edges
We study path auction games in which multiple edges may be owned by the same agent in this paper. The edge costs and the set of edges owned by the same agent are privately known to the owner of the edges. In this setting, we show that, assuming that losing agents always have 0 payoff, there is no individual rational, strategyproof mechanism in which only edge costs are reported. If the agents a...
متن کاملWeighted Optimal Path in Graph with Multiple Indexes
This paper represents a technique for finding optimal paths with multiple indexes in a graph. Up to the present time, all optimal paths have been determined upon one index, say, distance for which an evaluation method exists. In this paper firstly we define multiple indexes for each edge in such a way that anyone can treat the factor for assigning an optimal path. Here, we use Data Envelopment ...
متن کاملBiological auctions with multiple rewards.
The competition for resources among cells, individuals or species is a fundamental characteristic of evolution. Biological all-pay auctions have been used to model situations where multiple individuals compete for a single resource. However, in many situations multiple resources with various values exist and single reward auctions are not applicable. We generalize the model to multiple rewards ...
متن کاملMultiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees
Let G be an n-node and m-edge positively real-weighted undirected graph. For any given integer f ≥ 1, we study the problem of designing a sparse f-edge-fault-tolerant (f -EFT) σ-approximate single-source shortest-path tree (σ-ASPT), namely a subgraph of G having as few edges as possible and which, following the failure of a set F of at most f edges in G, contains paths from a fixed source that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.09.032